Leetcode-26:Remove Duplicates from Sorted Array

问题描述：

Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

问题示例

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
It doesn't matter what you leave beyond the new length.

我的答案

int removeDuplicates(vector<int>& nums) {
    int count = 0;
    int current;
    if(nums.empty()){
        return 0;
    }else{
        current = nums[0];
        count++;
    }
    for (int i=1; i<nums.size(); i++) {
        if(current != nums[i]){
            current = nums[i];
            nums[count] = current;
            count++;
        }
    }
    return count;
}

其他高效答案

int removeDuplicates(vector<int>& nums) {
        if(nums.size()==0)
            return 0;
        int count=1;
        int curr=nums[0];
        for(int i=1;i<nums.size();++i)
            if(curr != nums[i])
            {
                nums[count++] = nums[i];
                curr = nums[i];
            }
        return count;
    }

赏

谢谢你请我吃糖果

支付宝

微信